Two-dimensional multipass on-line tessellation acceptors
نویسندگان
چکیده
منابع مشابه
Effective Design of a 3×4 Two Dimensional Distributed Amplifier Based on Gate Line Considerations
In this paper two dimensional wave propagation is used for power combining in drain nodes of a distributed amplifier (DA). The proposed two dimensional DA uses an electrical funnel to add the currents of drain nodes. The proposed structure is modified due to gate lines considerations. Total gain improvement is achieved by engineering the characteristic impedance of gate lines and also make appr...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملEquity Bicriteria Location Models Using Line Tessellation
This paper examines a model to locate a facility within a given convex polygonal region taking two criteria of equity and efficiency into account. Equity, or rather inequality in the inhabitant-facility distances, is measured by minimizing the sum of the absolute differences between all pairs of squared Euclidean distances from inhabitants to the facility. This measure meets the Pigou-Dalton pr...
متن کاملTwo-Dimensional Rectangle Packing: On-Line Methods and Results
Csirik, J., J.B.G. Frenk and M. LabbC, Two-dimensional rectangle packing: on-line methods and results, Discrete Applied Mathematics 45 (1993) 197-204. The first algorithms for the on-line two-dimensional rectangle packing problem were introduced by Coppersmith and Raghavan. They showed that for a family of heuristics 13/4 is an upper bound for the asymptotic worst-case ratios. We have investiga...
متن کاملTwo-Dimensional On-Line Bin Packing Problem with Rotatable Items
In this paper, we consider a two-dimensional version of the on-line bin packing problem, in which each rectangular item that should be packed into unit square bins is “rotatable” by 90 ◦ . Two on-line algorithms for solving the problem are proposed. The second algorithm is an extension of the 2rst algorithm, and the worst-case ratio of the second one is at least 2.25 and at most 2.565. c © 2002...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1979
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(79)90604-1